On computing optimal policies in perishable inventory control using value iteration
نویسندگان
چکیده
منابع مشابه
Computing Exploration Policies via Closed-form Least-Squares Value Iteration
Optimal adaptive exploration involves sequentially selecting observations that minimize the uncertainty of state estimates. Due to the problem complexity, researchers settle for greedy adaptive strategies that are sub-optimal. In contrast, we model the problem as a belief-state Markov Decision Process and show how a non-greedy exploration policy can be computed using least-squares value iterati...
متن کاملOptimal pricing policies for perishable products
In many industrial settings, managers face the problem of establishing a pricing policy that maximizes the revenue from selling a given inventory of items by a fixed deadline, with the full inventory of items being available for sale from the beginning of the selling period. This problem arises in a variety of industries, including the sale of fashion garments, flight seats, and hotel rooms. We...
متن کاملComputing globally optimal (s,S,T) inventory policies
We consider a single-echelon inventory installation under the (s,S,T) periodic review ordering policy. Demand is stationary random and, when unsatisfied, is backordered. Under a standard cost structure, we seek to minimize total average cost in all three policy variables; namely, the reorder level s, the order-up-to level S and the review interval T. Considering time to be continuous, we first ...
متن کاملOn Computing Order Quantities for Perishable Inventory Control with Non-stationary Demand
We study the global optimal solution for a planning problem of inventory control of perishable products and non-stationary demand.
متن کاملOptimal joint replenishment, delivery and inventory management policies for perishable products
In this paper we analyze the optimal joint decisions of when, how and howmuch to replenish customers with products of varying ages. We discuss the main features of the problem arising in the joint replenishment and delivery of perishable products, and we model them under general assumptions. We then solve the problem by means of an exact branch-and-cut algorithm, and we test its performance on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Mathematical Methods
سال: 2019
ISSN: 2577-7408,2577-7408
DOI: 10.1002/cmm4.1027